منابع مشابه
Ring-magic labelings of graphs
In this paper, a generalization of a group-magic graph is introduced and studied. Let R be a commutative ring with unity 1. A graph G = (V,E) is called R-ring-magic if there exists a labeling f : E → R−{0} such that the induced vertex labelings f : V → R, defined by f(v) = Σf(u, v) where (u, v) ∈ E, and f : V → R, defined by f(v) = Πf(u, v) where (u, v) ∈ E, are constant maps. General algebraic...
متن کاملFault-Tolerant Ring Embedding in Star Graphs
In this paper, we consider an injured star graph with some faulty links and nodes. We show that even with fe n 3 faulty links a Hamiltonian cycle still can be found in an nstar, and that with fv n 3 faulty nodes a ring containing at most 4fv nodes less than that in a Hamiltonian cycle can be found (i.e., containing at leastn! 4fv nodes). In general, in an n-star with fe faulty links and fv faul...
متن کاملRing graphs and complete intersection toric ideals
We study the family of graphs whose number of primitive cycles equals its cycle rank. It is shown that this family is precisely the family of ring graphs. Then we study the complete intersection property of toric ideals of bipartite graphs and oriented graphs. An interesting application is that complete intersection toric ideals of bipartite graphs correspond to ring graphs and that these ideal...
متن کاملGraphs Associated with Finite Zero Ring
This paper introduces the notion of zero ring graphs. Basic properties of the zero ring graphs are investigated and characterization results regarding connectedness and planarity are given. Further, we determine the chromatic number for ΓM 2 (Zp[x]/〈x〉), where p is a prime, k > 1 and it is shown that an isomorphism exists among the zero ring graphs ΓM 2 (Zpk), ΓM 2 (Zp[x]/〈x〉) and ΓM 2 (Fpk).
متن کاملSelf-Stabilizing Ring Networks on Connected Graphs
Large networks require scalable routing. Traditionally, protocol overhead is reduced by introducing a hierarchy. This requires aggregation of nearby nodes under a common address prefix. In fixed networks, this is achieved administratively, whereas in wireless ad-hoc networks, dynamic assignments of nodes to aggregation units are required. As a result of the nodes commonly being assigned a rando...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mapana - Journal of Sciences
سال: 2010
ISSN: 0975-3303,0975-3303
DOI: 10.12723/mjs.16.5